Realizability for Constructive Zermelo-Fraenkel Set Theory Michael Rathjen∗ Department of Mathematics, Ohio State University Columbus, OH 43210, U.S.A.

Source URL: www1.maths.leeds.ac.uk

The Disjunction and Related Properties for Constructive Zermelo-Fraenkel Set Theory Michael Rathjen∗ Department of Mathematics, Ohio State University Columbus, OH 43210, U.S.A.

Source URL: www1.maths.leeds.ac.uk

Lifschitz Realizability for Intuitionistic Zermelo-Fraenkel Set Theory RAY-MING CHEN, School of Mathematics, University of Leeds Leeds LS2 9JT, UK, E-mail: MICHAEL RATHJEN, School of Mathematics, Un

Source URL: www1.maths.leeds.ac.uk

Chapter 15 Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions Michael Rathjen

Source URL: www1.maths.leeds.ac.uk

Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience Michael Rathjen Department of Pure Mathematics University of Leeds, Leeds LS2 9JT, England E-mail:

Source URL: www1.maths.leeds.ac.uk

Newman’s Typability Algorithm Herman Geuvers1 Radboud University Nijmegen and Eindhoven University of Technology The Netherlands

Source URL: www.cs.ru.nl

• Theoretical computer science
• Formal methods
• Mathematical logic
• Computability theory
• Type theory
• Algorithm
• Lambda calculus
• Combinatory logic
• Set theory
• Gottlob Frege
• Ernst Zermelo

THREE DAYS OF Ω-LOGIC PAUL B. LARSON The Zermelo-Fraenkel axioms for set theory with the Axiom of Choice (ZFC) form the most commonly accepted foundations for mathematical practice, yet it is well-known that many mathe

Source URL: www.users.miamioh.edu

Are Collections Sets? Karen M. Wickett, Allen H. Renear Jonathan Furner Center for Informatics Research in Science and Scholarship

Source URL: www.asis.org

• Set theory
• Z notation
• Predicate logic
• Functions and mappings
• S
• Equivalence relation
• Binary relation
• Finitary relation
• Zermelo–Fraenkel set theory
• Mathematical logic
• Mathematics
• Logic

An infinitely descending sequence of sound theories each proving the next consistent (Brief technical note) Benja Fallenstein This document is part of a collection of quick writeups of results from the December 2013 MIRI

Source URL: intelligence.org

• Mathematics
• Z notation
• Zermelo–Fraenkel set theory
• Ordinal numbers
• Constructible universe
• Ordinal analysis
• Consistency
• Forcing
• Proof theory
• Mathematical logic
• Logic

Cut elimination for Zermelo set theory: Proof of 53 easy lemmas Gilles Dowek1 and Alexandre Miquel2 1 ´ Ecole polytechnique and INRIA ´

Source URL: who.rocq.inria.fr